Addendum to \New Notions of Reduction and Non-Semantic Proofs of -Strong Normalization in Typed -Calculi"
نویسنده
چکیده
This addendum to our technical report of December 1994 KW94b] has several purposes: 1. To clarify some statements about the focus and purpose of the paper which were written unclearly. 2. To add information on research by others on the notion of reduction which we call-reduction and other similar transformations. 3. To discuss the closely-related research by P. de Groote of which we were unfortunately unaware. This discussion has three parts: (a) A comparison of the way de Groote reduces the-SN problem to a weak normalization problem which is very close to our method. (b) A discussion of how de Groote's proposed-SN proof for the simply-typed-calculus fails and how our proof avoids the aw in de Groote's proof. (c) A comparison of the diierent ways in which our paper and de Groote's paper go beyond the simply-typed-calculus. 4. To discuss an earlier method by Klop for reducing a-SN problem to a weak normalization problem, which could be extended to a-SN proof for the intersection-type system by using the method of our paper. 5. To x the incorrect proof of Lemma 3.2. We will discuss these items in this order.
منابع مشابه
New Notions of Reduction and Non-Semantic Proofs of -Strong Normalization in Typed -Calculi
Two new notions of reduction for terms of the -calculus are introduced and the question of whether a -term is -strongly normalizing is reduced to the question of whether a -term is merely normalizing under one of the new notions of reduction. This leads to a new way to prove -strong normalization for typed -calculi. Instead of the usual semantic proof style based on Girard's \candidats de r edu...
متن کاملArithmetical proofs of strong normalization results for the symmetric λμ-calculus
The symmetric λμ-calculus is the λμ-calculus introduced by Parigot in which the reduction rule μ′, which is the symmetric of μ, is added. We give arithmetical proofs of some strong normalization results for this calculus. We show (this is a new result) that the μμ′-reduction is strongly normalizing for the un-typed calculus. We also show the strong normalization of the βμμ′-reduction for the ty...
متن کامل7 M ay 2 00 9 Arithmetical proofs of strong normalization results for the symmetric λ μ - calculus
The symmetric λμ-calculus is the λμ-calculus introduced by Parigot in which the reduction rule μ′, which is the symmetric of μ, is added. We give arithmetical proofs of some strong normalization results for this calculus. We show (this is a new result) that the μμ′-reduction is strongly normalizing for the un-typed calculus. We also show the strong normalization of the βμμ′-reduction for the ty...
متن کاملCalculi of Generalized beta-Reduction and Explicit Substitutions: The Type-Free and Simply Typed Versions
Extending the λ-calculus with either explicit substitution or generalized reduction has been the subject of extensive research recently, and still has many open problems. This paper is the first investigation into the properties of a calculus combining both generalized reduction and explicit substitutions. We present a calculus, λgs, that combines a calculus of explicit substitution, λs, and a ...
متن کاملOn Girard's "Candidats de Reductibilité"
We attempt to elucidate the conditions required on Girard's candidates of reducibility (in French, "candidats de reductibilité ") in order to establish certain properties of various typed lambda calculi, such as strong normalization and Church-Rosser property. We present two generalizations of the candidates of reducibility, an untyped version in the line of Tait and Mitchell, and a typed versi...
متن کامل